Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic path order with status [19].
Quasi-Precedence:
[f1, +2, 0]
Status: +2: [2,1]
f1: [1]
0: multiset